Realization and bifurcation of Boolean Functions via Cellular Neural Networks
نویسندگان
چکیده
In this work, we study the realization and bifurcation of Boolean functions of four variables via a Cellular Neural Network (CNN). We characterize the basic relations between the genes and the offsets of an uncoupled CNN as well as the basis of the binary input vectors set. Based on the analysis, we have rigorously proved that there are exactly 1882 linearly separable Boolean functions of four variables, and found an effective method for realizing all linearly separable Boolean functions via an uncoupled CNN. Consequently, any kind of linearly separable Boolean function can be implemented by an uncoupled CNN, and all CNN genes that are associated with these Boolean functions, called the CNN gene bank of four variables, can be easily determined. Through this work, we will show that the standard CNN invented by Chua and Yang in 1988 indeed is very essential not only in terms of engineering applications but also in the sense of fundamental mathematics.
منابع مشابه
Integrating Fast Karnough Map and Modular Neural Networks for Simplification and Realization of Complex Boolean Functions
In this paper a new fast simplification method is presented. Such method realizes Karnough map with large number of variables. In order to accelerate the operation of the proposed method, a new approach for fast detection of group of ones is presented. Such approach implemented in the frequency domain. The search operation relies on performing cross correlation in the frequency domain rather th...
متن کاملIntegrating Fast Karnough Map and Modular Neural Networks for Simplification and Realization of Complex Boolean Functions
In this paper a new fast simplification method is presented. Such method realizes Karnough map with large number of variables. In order to accelerate the operation of the proposed method, a new approach for fast detection of group of ones is presented. Such approach implemented in the frequency domain. The search operation relies on performing cross correlation in the frequency domain rather th...
متن کاملRealization of Boolean Functions Using Binary Pi-sigma Networks
This paper introduces a higher-order neural network called the Binary Pi-sigma Network (BPSN), which is a feedforward network with a single \hidden" layer and product units in the output layer. As training proceeds, the BPSN forms an internal representation of the conjunctive normal form expression corresponding to the Boolean function to be learned. This enables the network to have a regular s...
متن کاملConstrained consumable resource allocation in alternative stochastic networks via multi-objective decision making
Many real projects complete through the realization of one and only one path of various possible network paths. Here, these networks are called alternative stochastic networks (ASNs). It is supposed that the nodes of considered network are probabilistic with exclusive-or receiver and exclusive-or emitter. First, an analytical approach is proposed to simplify the structure of t...
متن کاملThe computational power and complexity of discrete feedforward neural networks
The number of binary functions that can be defined on a set of L vectors in N R equals 2 . For L > N the total number of threshold functions in N-dimensional space grows polynomially , while the total number of Boolean functions, definable on N binary inputs, grows exponentially ( ), and as N increases a percentage of threshold functions in relation to the total number of Boolean functions – go...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- I. J. Bifurcation and Chaos
دوره 15 شماره
صفحات -
تاریخ انتشار 2005